﻿using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace DiscoveryLogic.DataViz.NetworkDiagram.Measures
{
    /// <summary>
    /// Johnson's algorithm solves all pairs shortest paths, and may be faster than Floyd-Warshall on sparse graphs.
    /// http://en.wikipedia.org/wiki/Johnson's_algorithm
    /// </summary>
    class JohnsonDistanceMeasure
    {
    }
}
